Monotonic Mappings Invariant Linearisation of Finite Posets
نویسندگان
چکیده
In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic and antitonic mappings over the new linear poset.
منابع مشابه
Translation invariant mappings on KPC-hypergroups
In this paper, we give an extension of the Wendel's theorem on KPC-hypergroups. We also show that every translation invariant mapping is corresponding with a unique positive measure on the KPC-hypergroup.
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملMeet-continuity on $L$-directed Complete Posets
In this paper, the definition of meet-continuity on $L$-directedcomplete posets (for short, $L$-dcpos) is introduced. As ageneralization of meet-continuity on crisp dcpos, meet-continuity on$L$-dcpos, based on the generalized Scott topology, ischaracterized. In particular, it is shown that every continuous$L$-dcpo is meet-continuous and $L$-continuous retracts ofmeet-continuous $L$-dcpos are al...
متن کاملOff-equilibrium Linearisation and Design of Gain Scheduled Control with Application to Vehicle Speed Control
In conventional gain scheduled control design, linearisation of a time-invariant nonlinear system and local control design for the resulting set of linear time-invariant systems is performed at a set of equilibrium points. Due to its validity only near equilibrium, such a design may result in poor transient performance. To resolve this problem one can base the control design on a dynamic linear...
متن کاملDefinability in Substructure Orderings, II: Finite Ordered Sets
Let P be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We prove among other things that for every finite poset P , the set {p, p} is definable, where p and p are the isomorphism types of P and its dual poset. We prove that the only non-identity automorphism of P is the duality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1006.2679 شماره
صفحات -
تاریخ انتشار 2010